A general induction theorem for rearrangements of n-tuples
نویسندگان
چکیده
منابع مشابه
Commutant lifting theorem for n-tuples of contractions
We show that the commutant lifting theorem for n-tuples of commuting contractions with regular dilations fails to be true. A positive answer is given for operators which ”double intertwine” given n-tuples of contractions. The commutant lifting theorem is one of the most important results of the Sz. Nagy—Foias dilation theory. It is usually stated in the following way: Theorem. Let T and T ′ be ...
متن کاملBell's theorem for general N-qubit states.
We derive a single general Bell inequality which is a sufficient and necessary condition for the correlation function for N particles to be describable in a local and realistic picture, for the case in which measurements on each particle can be chosen between two arbitrary dichotomic observables. We also derive a necessary and sufficient condition for an arbitrary N-qubit mixed state to violate...
متن کاملA More General Version of the Costa Theorem
In accordance with the Costa theorem, the interference which is independent of the channel input and known non-causally at the transmitter, does not affect the capacity of the Gaussian channel. In some applications, the known interference depends on the input and hence has some information. In this paper, we study the channel with input dependent interference and prove a capacity theorem that n...
متن کاملOrbits on n-tuples
A transitive (infinite) permutation group which has m orbits on ordered pairs of distinct points has at least mn−1 orbits on ordered n-tuples. This is best possible, and groups attaining the bound can be characterised.
متن کاملPacking of graphic n-tuples
An n-tuple π (not necessarily monotone) is graphic if there is a simple graph G with vertex set {v1, . . . , vn} in which the degree of vi is the ith entry of π. Graphic n-tuples (d (1) 1 , . . . , d (1) n ) and (d (2) 1 , . . . , d (2) n ) pack if there are edge-disjoint n-vertex graphs G1 and G2 such that dG1(vi) = d (1) i and dG2(vi) = d (2) i for all i. We prove that graphic n-tuples π1 and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1976
ISSN: 0022-247X
DOI: 10.1016/0022-247x(76)90121-9